New Second-Preimage Attacks on Hash Functions
نویسندگان
چکیده
منابع مشابه
Second Preimage Attacks on Dithered Hash Functions
The goal of this paper is to analyze the security of dithered variants of the Merkle-Damgård mode of operation that use a third input to indicate the position of a block in the message to be hashed. These modes of operation for hash functions have been proposed to avoid some structural weaknesses of the Merkle-Damgard paradigm, e.g. that second preimages can be constructed in much less than 2 w...
متن کاملNew Second Preimage Attacks on Dithered Hash Functions with Low Memory Complexity
Dithered hash functions were proposed by Rivest as a method to mitigate second preimage attacks on Merkle-Damg̊ard hash functions. Despite that, second preimage attacks against dithered hash functions were proposed by Andreeva et al. One issue with these second preimage attacks is their huge memory requirement in the precomputation and the online phases. In this paper, we present new second prei...
متن کاملPractical (Second) Preimage Attacks on the TCS_SHA-3 Family of Cryptographic Hash Functions
TCS_SHA-3 is a family of four cryptographic hash functions that are covered by a United States patent (US 2009/0262925). The digest sizes are 224, 256, 384 and 512 bits. The hash functions use bijective functions in place of the standard compression functions. In this paper we describe first and second preimage attacks on the full hash functions. The second preimage attack requires negligible t...
متن کاملPreimage Attacks Against Spectral Hash and PTX Functions
This paper presents a novel pre-image attack on SHA-3 candidate Spectral Hash (shash), which was until now thought to be resistant to pre-image attacks. PTX (Permute Transform XOR) functions are an idealisation of shash [1] in which its pseudorandom functions have been replaced with random oracles. We extend our previous practical collision attacks on PTX functions to practical pre-image attack...
متن کاملPractical Hash Functions Constructions Resistant to Generic Second Preimage Attacks Beyond the Birthday Bound
Most cryptographic hash functions rely on a simpler primitive called a compression function, and in nearly all cases, there is a reduction between some of the security properties of the full hash function and those of the compression function. For instance, a celebrated result of Merkle and Damg̊ard from 1989 states that a collision on the hash function cannot be found without finding a collisio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2015
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-015-9206-4